Analysis of Gang Scheduling Strategy with Speed-up’s in Parallel Systems Environment

T.N.Ravi, Dr. D.I. George Amalarethinam, & Dr. R. Balasubramanian Abstract Effective scheduling strategies to improve response times, throughput and utilization are important considerations in large scale computing environments. The nearly Space Sharing strategies resulted in low system utilization and large job waiting times. Gang scheduling combines both space sharing and time sharing. This paper analyses the Gang Scheduling technique that can be used beyond simple space sharing to greatly improve the performance of large parallel systems. The main contribution of this paper is an evaluation of Minimum Schedule Length and Speed up’s of Gang Scheduling technique, for five different applications.